Choosing Nonmortars: Does it Influence the Performance of FETI-DP Algorithms?
نویسنده
چکیده
We investigate whether different choices of nonmortar sides for the geometrically conforming partitions inherent to FETI–DP influence the convergence of the algorithms for four different preconditioners. We conclude experimentally that they do not, although better condition number estimates exist for a Neumann-Dirichlet choice of nonmortars.
منابع مشابه
A unified FETI-DP approach for incompressible Stokes equations
A unified framework of FETI-DP algorithms is proposed for solving the system of linear equations arising from the mixed finite element approximation of incompressible Stokes equations. A distinctive feature of this framework is that it allows using both continuous and discontinuous pressures in the algorithm, while previous FETI-DP methods only apply to discontinuous pressures. A preconditioned...
متن کاملA 738
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...
متن کاملFETI–DP, BDDC, and Block Cholesky Methods
Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...
متن کاملA Simple Explicit-Implicit FETI Transient Analysis Algorithm
A simple explicit-implicit FETI transient analysis procedure is presented, which utilizes the same basic FETI solver developed for static structural analysis problems. A key concept for the present algorithm is to integrate d’Alembert-Lagrange principal equations, viz., the domain-by-domain floating dynamic selfequilibrium equations, by an explicit algorithm. The remaining deformation modes are...
متن کاملQuadratic Programming and Scalable Algorithms for Variational Inequalities
We first review our recent results concerning optimal algorithms for the solution of bound and/or equality constrained quadratic programming problems. The unique feature of these algorithms is the rate of convergence in terms of bounds on the spectrum of the Hessian of the cost function. Then we combine these estimates with some results on the FETI method (FETI-DP, FETI and Total FETI) to get t...
متن کامل